منابع مشابه
Distributed Selfish Replication under Node Churn
In this paper the impact of node churn on the effectiveness of a distributed selfish replication group is investigated. In such a group, nodes cooperate in deciding which objects to store, so that the cost of providing content to their clientele be decreased, compared to that induce when operating in isolation. In order for a cooperation scheme to be sustainable, nodes should not be mistreated;...
متن کاملOn the Social Cost of Distributed Selfish Content Replication
We study distributed content replication networks formed voluntarily by selfish autonomous users, seeking access to information objects that originate from distant servers. Each user caters to minimization of its individual access cost by replicating locally (up to constrained storage capacity) a subset of objects, and accessing the rest from the nearest possible location. We show existence of ...
متن کاملLocal Distributed Algorithms for Selfish Agents
In the classical framework of local distributed network computing, it is generally assumed that the entities executing distributed algorithms are altruistic. However, in various scenarios, the value of the output produced by an entity may have a tremendous impact on its future. This is for instance the case of tasks such as computing maximal independent sets (MIS) in networks. Indeed, a node be...
متن کاملApproximation Algorithms for Distributed and Selfish Agents
Many real-world systems involve distributed and selfish agents who optimize their own objective function. In these systems, we need to design efficient mechanisms so that system-wide objective is optimized despite agents acting in their own self interest. In this thesis, we develop approximation algorithms and decentralized mechanisms for various combinatorial optimization problems in such syst...
متن کاملCache Me If You Can: Capacitated Selfish Replication Games
Motivated by peer-to-peer (P2P) networks and content delivery applications, we study Capacitated Selfish Replication (CSR) games, which involve nodes on a network making strategic choices regarding the content to replicate in their caches. Selfish replication games were introduced in [6], who analyzed the uncapacitated case leaving the capacitated version as an open direction. In this work, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2006
ISSN: 1045-9219
DOI: 10.1109/tpds.2006.171